| Definitions | es-interface-history(es;X;e), P    Q, P Q, concat(ll), l[i],  , A  B, False, ||as||, mapfilter(f;P;L), es-le-before(es;e),  x:A. B(x), a < b, (x  l),  x.A(x), (e <loc e'), P  Q, e loc e' , A c B, True, inl x , tt, inr x , ff, X(e), e  X, if b then t else f fi , case b of inl(x) => s(x) | inr(y) => t(y), t.1, E(X), {x:A| B(x)} , E, let x,y = A in B(x;y), AbsInterface(A), ES, Top, P & Q,  x. t(x), first(e), pred(e),  A, <a, b>, x,y. t(x;y), pred!(e;e'),  , SWellFounded(R(x;y)), constant_function(f;A;B),  b,  , e < e', r s, val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time),  , type List, Msg(M), kind(e), loc(e), Knd, kindcase(k; a.f(a); l,t.g(l;t) ), EOrderAxioms(E; pred?; info), x:A  B(x), IdLnk, left + right, Unit, EqDecider(T), Type, P Q, strong-subtype(A;B),  , Id, f(a), a:A fp B(a), EState(T),  x:A. B(x), x:A B(x), t T, s = t, x dom(f), [], last(L), hd(l), [car / cdr], S  T, |g|, Void, #$n, Outcome |